Secure E-Tendering Using Identity Based Encryption from Bilinear Pairings
نویسندگان
چکیده
An electronic tender system (e-tender) streamlines the tender process and thereby saves time and cost. Security requirements for e-tendering systems have not been closely scrutinized in the literature. In addition to the security concerns of conventional e-tender systems—authentication, integrity, privacy, and non-repudiation are provided. This paper identifies key issues to be addressed in the design of secure e-tendering systems. Key issues are the privacy protection and verifiability. A new e-tendering architecture, based on Identity Based Encryption from bilinear pairings is proposed which may be suitable for secure large scale operations. A Encryption is a scheme that provides private and authenticated delivery of message between tenderer and tenderee. This is done in a more efficient manner than a straight forward composition of an encryption followed by signature scheme. An Identity based Cryptosystem is one in which the public key may be as String (E-mail Address, PAN No., etc). We propose Identity based encryption for secure e-tendering system that satisfies all the requirements an ideal atomic system requires. The elegant design makes it efficient both in computation and in communication. Secure e-Tendering System is carrying out of the tendering process using electronic means, such as the internet and specialist e-tendering software applications with a secured scheme.
منابع مشابه
Secure E-Tendering System using Identity Based Signcryption from Bilinear Pairings
An electronic tender system (e-tender) streamlines the tender process and thereby saves time and cost. Security requirements for e-tendering systems have not been closely scrutinized in the literature. In addition to the security concerns of conventional e-tender systems—authentication, integrity, privacy, and non-repudiation are provided. This paper identifies key issues to be addressed in the...
متن کاملAnonymous Constant-Size Ciphertext HIBE from Asymmetric Pairings
We present a new hierarchical identity based encryption (HIBE) scheme with constant-size ciphertext that can be implemented using the most efficient bilinear pairings, namely, Type-3 pairings. In addition to being fully secure, our scheme is anonymous. The HIBE is obtained by extending an asymmetric pairing based IBE scheme due to Lewko and Waters. The extension uses the approach of Boneh-Boyen...
متن کاملAttribute-based encryption implies identity-based encryption
In this short paper we formally prove that designing attribute-based encryption schemes cannot be easier than designing identity-based encryption schemes. In more detail, we show how an attribute-based encryption scheme which admits, at least, AND policies can be combined with a collision-resistant hash function to obtain an identity-based encryption scheme. Even if this result may seem natural...
متن کاملA tapestry of identity-based encryption: practical frameworks compared
This paper surveys the practical benefits and drawbacks of several identitybased encryption schemes based on bilinear pairings. After providing some background on identity-based cryptography, we classify the known constructions into a handful of general approaches. We then describe efficient and fully-secure IBE and IBKEM instantiations of each approach, with reducibility to practice as the mai...
متن کامل(Anonymous) Fully Secure Constant-Size Ciphertext HIBE From Type-3 Pairings
This paper takes a comprehensive look at hierarchical identity-based encryption (HIBE) schemes with constant-size ciphertexts which provide desirable provable guarantees and can be implemented using the most efficient bilinear pairings, namely, Type-3 pairings. Our work results in six new HIBE schemes. The first construction, DPVS-HIBE , is obtained by extending the IBE scheme of Chen et.al. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012